package 动态规划;
//https://leetcode.cn/problems/two-sum/
public class 两数之和 {
    public int[] twoSum(int[] nums, int target) {
        int[] arr = new int[2];
        for (int i = 0 ; i < nums.length ; i ++){
            for (int j = i + 1; j < nums.length ; j ++){
                if (nums[i] + nums[j] == target){
                    arr[0] = i;
                    arr[1] = j;
                    break;
                }
            }
        }
        return arr;
    }
}
